Cooperative scheduling in an agro-food production under machine availability constraints

In this paper, we propose two methods for the optimization of the total duration of production in an agro-food Industry by considering the account constraints of availability of machines. The first method applied, the Branch and Bound method, is a method of optimization based on a checked enumeration that supplies, generally, an optimal solution [I]. In the second part, an approached method is applied which is the genetic algorithm. Finally, a comparative study between both methods and their results will be presented